Employing Lexicalized Dependency Paths for Active Learning of Relation Extraction

نویسندگان

چکیده

Active learning methods which present selected examples from the corpus for annotation provide more efficient of supervised relation extraction models, but they leave developer in unenviable role a passive informant. To restore developer’s proper as partner with system, we must give an ability to inspect model during development. We propose make this possible through representation based on lexicalized dependency paths (LDPs) coupled active learner LDPs. apply LDPs both simulated and real ACE evaluation year’s newswire training show that greatly reduces cost while maintaining similar performance level learning, yields comparable state-of-the-art using small number annotations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploring Correlation of Dependency Relation Paths for Answer Extraction

In this paper, we explore correlation of dependency relation paths to rank candidate answers in answer extraction. Using the correlation measure, we compare dependency relations of a candidate answer and mapped question phrases in sentence with the corresponding relations in question. Different from previous studies, we propose an approximate phrase mapping algorithm and incorporate the mapping...

متن کامل

Learning Relational Dependency Networks for Relation Extraction

We consider the task of KBP slot filling – extracting relation information from newswire documents for knowledge base construction. We present our pipeline, which employs Relational Dependency Networks (RDNs) to learn linguistic patterns for relation extraction. Additionally, we demonstrate how several components such as weak supervision, word2vec features, joint learning and the use of human a...

متن کامل

Dependency Tree Kernels for Relation Extraction

We extend previous work on tree kernels to estimate the similarity between the dependency trees of sentences. Using this kernel within a Support Vector Machine, we detect and classify relations between entities in the Automatic Content Extraction (ACE) corpus of news articles. We examine the utility of different features such as Wordnet hypernyms, parts of speech, and entity types, and find tha...

متن کامل

Incorporating Relation Paths in Neural Relation Extraction

Distantly supervised relation extraction has been widely used to find novel relational facts from plain text. To predict the relation between a pair of two target entities, existing methods solely rely on those direct sentences containing both entities. In fact, there are also many sentences containing only one of the target entities, which also provide rich useful information but not yet emplo...

متن کامل

Minimally Lexicalized Dependency Parsing

Dependency structures do not have the information of phrase categories in phrase structure grammar. Thus, dependency parsing relies heavily on the lexical information of words. This paper discusses our investigation into the effectiveness of lexicalization in dependency parsing. Specifically, by restricting the degree of lexicalization in the training phase of a parser, we examine the change in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Intelligent Automation and Soft Computing

سال: 2022

ISSN: ['2326-005X', '1079-8587']

DOI: https://doi.org/10.32604/iasc.2022.030794